Sharp upper bound involving circuit layout system
نویسندگان
چکیده
منابع مشابه
A Sharp Upper Bound on Algebraic Connectivity Using Domination Number
Let G be a connected graph of order n. The algebraic connectivity of G is the second smallest eigenvalue of the Laplacian matrix of G. A dominating set in G is a vertex subset S such that each vertex of G that is not in S is adjacent to a vertex in S. The least cardinality of a dominating set is the domination number. In this paper, we prove a sharp upper bound on the algebraic connectivity of ...
متن کاملA Sharp Upper Bound for the Lattice Programming Gap
Given a full-dimensional lattice Λ ⊂ Z and a vector l ∈ Qd>0, we consider the family of the lattice problems Minimize {l · x : x ≡ r(mod Λ),x ∈ Zd≥0} , r ∈ Z d . (0.1) The lattice programming gap gap(Λ, l) is the largest value of the minima in (0.1) as r varies over Z. We obtain a sharp upper bound for gap(Λ, l).
متن کاملImproved Monotone Circuit Depth Upper Bound for Directed Graph Reachability
We prove that the directed graph reachability problem (transitive closure) can be solved by monotone fan-in 2 boolean circuits of depth (1/2+o(1))(log n)^2, where n is the number of nodes. This improves the previous known upper bound (1+o(1))(log n)^2. The proof is non-constructive, but we give a constructive proof of the upper bound (7/8+o(1))(log n)^2.
متن کاملSharp upper bound for the rainbow connection numbers of 2-connected graphs
An edge-colored graph G, where adjacent edges may be colored the same, is rainbow connected if any two vertices of G are connected by a path whose edges have distinct colors. The rainbow connection number rc(G) of a connected graph G is the smallest number of colors that are needed in order to make G rainbow connected. In this paper, we give a sharp upper bound that rc(G) ≤ ⌈n2 ⌉ for any 2-conn...
متن کاملA sharp upper bound on the approximation order of smooth bivariate pp functions
A first result along these lines was given in [BH831] where it was shown that the approximation order of Π3,∆ (with ∆ the three-direction mesh) is only 3, which was surprising in view of the fact that all cubic polynomials are contained locally in this space. [J83] showed the corresponding result for C-quartics on the three-direction mesh and [BH832] provided upper and lower bounds for the appr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Nonlinear Sciences and Applications
سال: 2016
ISSN: 2008-1901
DOI: 10.22436/jnsa.009.04.46